The Pumping Lemma for Well-Nested Multiple Context-Free Languages
نویسنده
چکیده
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is pumpable at some 2m substrings. We prove a pumping lemma of the usual universal form for the subclass consisting of well-nested multiple context-free languages. This is the same class of languages generated by non-duplicating macro grammars and by coupled-context-free grammars.
منابع مشابه
Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars
The pumping lemma and Ogden lemma offer a powerful method to prove that a particular language is not context-free. In 2008 Kanazawa proved an analogue of pumping lemma for well-nested multiplecontext free languages. However, the statement of lemma is too weak for practical usage. We prove a stronger variant of pumping lemma and an analogue of Ogden lemma for the class of tree-adjoining language...
متن کاملA Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata
The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-known pumping lemma for regular languages. However, though the lemma for regular languages is simply proved by using the pigeonhole principle on deterministic automata, the lemma for pushdown automata is proven through an equivalence with context-free languages and through th...
متن کاملA Solution to Yamakami's Problem on Advised Context-free Languages
Yamakami (Theoret. Comput. Sci., 2011) studies context-free languages with advice functions. Here, the length of an advice is assumed to be the same as that of an input. Let CFL and CFL/n denote the class of all context-free languages and that with advice functions, respectively. We let CFL(2) denote the class of intersections of two context-free languages. An interesting direction of a researc...
متن کاملFormalization of the pumping lemma for context-free languages
Context-free languages (CFLs) are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma is a property that is valid for all context-free languages, and is used to show the existence of non context-free languages. This paper presents a formalization, using the Coq proof assistant, of the Pumping Lemma for context-free languages.
متن کاملPumping Lemma for Higher-order Languages
We study a pumping lemma for the word/tree languages generated by higher-order grammars. Pumping lemmas are known up to order-2 word languages (i.e., for regular/context-free/indexed languages), and have been used to show that a given language does not belong to the classes of regular/context-free/indexed languages. We prove a pumping lemma for word/tree languages of arbitrary orders, modulo a ...
متن کامل